翻訳と辞書 Words near each other ・ Generalized Helmholtz theorem ・ Generalized hypergeometric function ・ Generalized hyperhidrosis ・ Generalized integer gamma distribution ・ Generalized inverse ・ Generalized inverse Gaussian distribution ・ Generalized inversive congruential pseudorandom numbers ・ Generalized iterative scaling ・ Generalized Jacobian ・ Generalized Kac–Moody algebra ・ Generalized keyboard ・ Generalized Korteweg–de Vries equation ・ Generalized Lagrangian mean ・ Generalized least squares ・ Generalized lentiginosis ・ Generalized lifting ・ Generalized linear array model ・ Generalized linear mixed model ・ Generalized linear model ・ Generalized logistic distribution ・ Generalized Lotka–Volterra equation ・ Generalized lymphadenopathy ・ Generalized map ・ Generalized Maxwell model ・ Generalized mean ・ Generalized method of moments ・ Generalized minimal residual method ・ Generalized minimum-distance decoding ・ Generalized Multi-Protocol Label Switching ・ Generalized multidimensional scaling Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Generalized lifting ： ウィキペディア英語版 Generalized lifting Generalized lifting scheme was developed by (Joel Solé ) and (Philippe Salembier ) and published in Joel's PhD Thesis.〔Ph.D. Thesis Dissertation: Optimization and Generalization of Lifting Schemes: Application to Lossless Image Compression〕 It is based on classical lifting scheme and generalizes it breaking out a restriction hidden in the scheme structure. Classical lifting scheme has three kind of operations. # Lazy wavelet transform splits signal $f\_j()$ in two new signals: the odd samples signal denoted by $f\_j^o()$ and the even samples signal denoted by $f\_j^e()$. # Prediction step its objective is compute a prediction for the odd samples, based on the even samples (or vice versa). This prediction is subtracted from the odd samples creating an error signal $g\_()$. # Update step This step recalibrates the low frequency branch with some of the energy removed during subsampling. In the case of classical Lifting, this is used in order to "prepare" the signal for the next prediction step. It uses the predicted odd samples $g\_()$ to prepare the even ones $f\_j^e()$ (or vice versa). This update is subtracted from the even samples producing the signal denoted by $f\_()$. The scheme is invertible due to the structure of itself. In the receiver the update step is computed first. Its result is added to the even samples. After that, it's possible to compute exactly the same prediction and add it to the odd samples. In order to recover the original signal, we have to invert the Lazy Wavelet Transform. Generalized lifting scheme has the same three kind of operations. However this scheme avoids the addition-subtraction restriction that offered Classical Lifting. That fact has some consequences. For example, the design of all steps must guarantee the scheme invertibility (not guaranteed if the addition-subtraction restriction is avoided). == Definition == ''Generalized lifting scheme'' is a dyadic transform that follows these rules: # Computes a Lazy Wavelet Transform and splits even samples from odd samples. # Computes a Prediction Mapping. This step tries to predict odd samples taking into account the even ones (or vice versa). This a mapping from the space of the samples in $f\_j^e()$ to the space of the samples in $g\_()$. In this case the samples (from $f\_j^e()$) chosen to be the reference for $f\_j^o()$ are called the context. It could be expressed as: #:$\backslash textstyle\; g\_()\; =\; P(f\_j^o();f\_j^e())$ # Computes an Update Mapping. This step tries to update the even samples taking into account the odd predicted samples. It would be a kind of preparation for the next prediction step, if any. It could be expressed: #:$\backslash textstyle\; f\_()\; =\; U(f\_j^e();g\_())$ Obviously, these mappings cannot be any functions. In order to guarantee the invertibility of the scheme itself, all mappings involved in the transform must be invertible. In case that mappings arise and arrive on finite sets (discrete bounded value signals), this condition is equivalent to saying that mappings are injective (one-to-one). Moreover, if a mapping goes from one set to a set of the same cardinality, it should be bijective. In the Generalized Lifting Scheme the addition/subtraction restriction is avoided by including this step in the mapping. In this way the Classical Lifting Scheme is generalized. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Generalized lifting」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.